G-random binary sequence

G-random binary sequence
Г-случайная двоичная последовательность (двоичная последовательность называется Г-случайнои, если она удовлетворяет трем критериям случайности, сформулированным американские крипто.югом С. Голомбом в 1967г.).

English-Russian cryptological dictionary . 2014.

Игры ⚽ Поможем написать курсовую

Смотреть что такое "G-random binary sequence" в других словарях:

  • Pseudorandom binary sequence — A binary sequence (BS) is a sequence of N bits, :a j for j=0,1,...,N 1, i.e. m ones and N m zeros. A BS is pseudo random (PRBS) if its autocorrelation function :C(v)=sum {j=0}^{N 1} a ja {j+v}has only two values::C(v)=egin{cases}m, mbox{ if }… …   Wikipedia

  • Pseudorandom number sequence — A Pseudorandom number sequence is a sequence of numbers that has been computed by some defined arithmetic process but is effectively a random number sequence for the purpose for which it is required. Although a pseudorandom number sequence in… …   Wikipedia

  • Binary numeral system — Numeral systems by culture Hindu Arabic numerals Western Arabic (Hindu numerals) Eastern Arabic Indian family Tamil Burmese Khmer Lao Mongolian Thai East Asian numerals Chinese Japanese Suzhou Korean Vietnamese …   Wikipedia

  • Random access — In computer science, random access (sometimes called direct access) is the ability to access an arbitrary element of a sequence in equal time. The opposite is sequential access, where a remote element takes longer time to access. A typical… …   Wikipedia

  • Algorithmically random sequence — Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm. The definition applies equally well to sequences on any finite set of characters. Random sequences …   Wikipedia

  • Hardware random number generator — This SSL Accelerator computer card uses a hardware random number generator to generate cryptographic keys to encrypt data sent over computer networks. In computing, a hardware random number generator is an apparatus that generates random numbers… …   Wikipedia

  • Maximum length sequence — A maximum length sequence (MLS) is a type of pseudorandom binary sequence. They are bit sequences generated using maximal linear feedback shift registers and are so called because they are periodic and reproduce every binary sequence that can be… …   Wikipedia

  • Main sequence — A Hertzsprung Russell diagram plots the actual brightness (or absolute magnitude) of a star against its color index (represented as B V). The main sequence is visible as a prominent diagonal band that runs from the upper left to the lower right.… …   Wikipedia

  • De Bruijn sequence — A diagram showing the De Bruijn sequence where k=2 and n=2 In combinatorial mathematics, a k ary De Bruijn sequence B(k, n) of order n, named after the Dutch mathematician Nicolaas Govert de Bruijn, is a cyclic sequence of a given alphabet A …   Wikipedia

  • Time Independent Escape Sequence — The Time Independent Escape Sequence, or TIES, was a short lived modem standard invented to avoid a patent held by Hayes Microcomputer Products. TIES was an escape sequence that switched the modem from data mode to command mode , allowing… …   Wikipedia

  • Pseudorandomness — A pseudorandom process is a process that appears random but is not. Pseudorandom sequences typically exhibit statistical randomness while being generated by an entirely deterministic causal process. Such a process is easier to produce than a… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»